Bitonic Sorting on Bene Networks
نویسنده
چکیده
An algorithm derived from bitonic sorting networks and appropriate routings are presented which will sort a set of N inputs via a Beneš network. An expanded version of Knuth diagrams for sorting networks is also presented which illustrates the address line logic within the network.
منابع مشابه
The Bitonic Sort on Transputer Architectures
The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable to Transputer arrays. This paper looks at the implementation and time cost of the algorithm for a machine and compares this with an implementation on T8 networks to see the benefits that the new architecture provides over the previous generation of Transputers.
متن کاملCharacterizations of Generalized Butter y Networks
A multistage network is a Generalized Butterry Network (GBN) if there are 2 n end-to-end paths, (P 0 ; P 1 ; ; P n?1), that cover all the vertices and are vertex disjoint and for any two consecutive stages k and k + 1 there is an integer`s.t. the k-th vertex of P i is adjacent to the (k + 1)-th vertex of P j ii the binary presentations of i and j diier at most at thè-th bit. The GBN family cont...
متن کاملAdaptive Bitonic Sorting∗
Adaptive bitonic sorting is a sorting algorithm suitable for implementation on EREW parallel architectures. Similar to bitonic sorting, it is based on merging, which is recursively applied to obtain a sorted sequence. In contrast to bitonic sorting, it is data dependent. Adaptive bitonic merging can be performed in O ( n p ) parallel time, p being the number of processors, and executes only O (...
متن کاملA Adaptive Bitonic Sorting
Definition Adaptive bitonic sorting is a sorting algorithm suitable for implementation on EREW parallel architectures. Similar to bitonic sorting, it is based onmerging, which is recursively applied to obtain a sorted sequence. In contrast to bitonic sorting, it is data-dependent. Adap tive bitonic merging can be performed inO( p ) parallel time, p being the number of processors, ...
متن کاملAn Efficient Parallel Sorting Algorithm on Metacube Multiprocessors
Parallel sorting algorithms in hypercubes have been studied extensively. One of the practical parallel sorting algorithms is Bitonic Sort, which is implemented in O(n) time for sorting N = 2 numbers in an n-cube. A versatile family of interconnection networks alternative to hypercube, called metacube, was proposed for building extremely large scale multiprocessor systems with a small number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996